The Batch Machine Scheduling of Continuous Caster with Flexible Jobs to Minimize Setup Costs

نویسندگان

  • D. H. Yu
  • M. Huang
چکیده

The batch machine scheduling of continuous caster with flexible jobs is first proposed based on its character. The difference with classical problem is first summarized. The preprocess of the problem based on rule is proposed, and then the mathematical model with minimizing setup costs is proposed. To improve the efficiency of local search, the particle swarm optimization (PSO) is introduced, and then the PSO combined with heuristic is embedded into the iterated local search (ILS) to solve the problem. The solution space is divided into many subspaces based on the charge information, and then the subspaces are integrated after local search. The maximum number of iteration is introduced as stopping condition. Then, the proposed hybrid algorithm and ILS are compared, and the changing of number of generation, learning factors, and the maximum number of iteration are also tested, respectively. Finally, the simulation results show that the proposed algorithm can solve the problem efficiently.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Artificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain

This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...

متن کامل

Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints

In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...

متن کامل

A branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem

In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery.  jobs have to be scheduled on a single machine and delivered to  customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...

متن کامل

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

متن کامل

Role of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm

Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Concurrent Engineering: R&A

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2011